Consistency and Semantics of Equational Definitions over Predefined Algebras
نویسندگان
چکیده
We introduce and study the notion of an equational definition over a predefined algebra (EDPA) which is a modification of the notion of an algebraic specification enrichment. We argue that the latter is not quite appropriate when dealing with partial functions (in particular, with those defined by non-terminating functional programs), and suggest EDPA as a more adequate tool for specification and verification purposes. Several results concerning consistency of enrichments and correctness of EDPA are presented. The relations between EDPA and some other approaches to algebraic specification of partial functions are discussed.
منابع مشابه
FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملBreeding Algebraic Structures - An Evolutionary Approach To Inductive Equational Logic Programming
Concept learning is the induction of a description from a set of examples. Inductive logic programming can be considered a special case of the general notion of concept learning specifically referring to the induction of first-order theories. Both concept learning and inductive logic programming can be seen as a search over all possible sentences in some representation language for sentences th...
متن کاملSome Results in Dynamic Model Theory
First-order structures over a /xed signature give rise to a family of trace-based and relational Kleene algebras with tests de/ned in terms of Tarskian frames. A Tarskian frame is a Kripke frame whose states are valuations of program variables and whose atomic actions are state changes e2ected by variable assignments x := e, where e is a -term. The Kleene algebras with tests that arise in this ...
متن کامل